Perfectly Dynamic Average of Inter-reference Time as a Metric of Web Cache Replacement Policy
نویسنده
چکیده
Caching objects in Internet environment is aimed to reduce bandwidth consumption and increase the response time of system in term of user perception. In limited size of web cache, it needs to manage the objects in web cache so that the hit ratio and byte hit ratio are optimal. For solving this problem, researcher propose many web cache replacement policies such as LRU, LFU, GDS, GDSF, GD*, and IRT. In evicting object from web cache, each policies uses recency, frequency, size, size and frequency, or inter-reference time of object requested by user. The last metric, inter-reference time, has been explored intensively in previous research in memory cache replacement. This research proposes to apply perfectly dynamic average of inter-reference time (PDA-IRT), an extended version of DA-IRT, as a metric in evicting object from the web cache. Based on experiment using web trace log from three companies, it can be concluded that PDA-IRT can improve DA-IRT in term of HR and BHR.
منابع مشابه
On Efficient Replacement Policies for Cache Objects with Non-uniform Sizes and Costs
Replacement policies for cache management have been studied extensively. Most policies proposed in the literature tend to be ad hoc and typically exploit the retrieval cost or latency of the objects, object sizes, popularity of requests and temporal correlations between requests. A recent paper [1] studied the caching problem and developed an optimal replacement policy C ∗ 0 under the independe...
متن کاملRegularly Expected Reference-time as a Metric of Web Cache Replacement Policy
The growth of Internet access was increasing significantly. In facts, more than one user access the same object so there is an opportunity to reduce this redundancy by placing an intermediate storage called cache. By this approach, the bandwidth consumption and response time of system in term of user perception can be improved. When the size of web cache is limited, it needs to manage the objec...
متن کاملOptimal replacement policies for non-uniform cache objects with optional eviction
Replacement policies for general caching applications and Web caching in particular have been discussed extensively in the literature. Many ad-hoc policies have been proposed that attempt to take adavantage of the retrieval latency of documents, their size, the popularity of references and temporal locality of requested documents. However, the problem of finding optimal replacement policies und...
متن کاملEvaluating Server - Assisted Cache
1 To reduce user-perceived latency in retrieving documents on the world wide web, a commonly used technique is caching both at the client's browser and more gainfully (due to sharing) at a proxy. The eeec-tiveness of Web caching hinges on the replacement policy that determines the relative value of caching diierent objects. An important component of such policy is to predict next-request times....
متن کاملExploiting Gray-Box Knowledge of Buffer-Cache Management
The buffer-cache replacement policy of the OS can have a significant impact on the performance of I/Ointensive applications. In this paper, we introduce a simple fingerprinting tool, Dust, which uncovers the replacement policy of the OS. Specifically, we are able to identify how initial access order, recency of access, frequency of access, and long-term history are used to determine which block...
متن کامل